Tree Automata with Equality Constraints Modulo Equational Theories
نویسندگان
چکیده
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalized membership problem (extending the emptiness problem) is decidable by proving that the saturation of tree automata presentations with suitable paramodulation strategies terminates. Alternatively our results can be viewed as new decidable classes of first-order formula.
منابع مشابه
F . Jacquemard , M . Rusinowitch and L . Vigneron Tree automata with equality constraints modulo equational theories Research Report LSV - 05 - 16 August 2005
This paper presents new classes of tree automata combining automata with equality test with automata modulo equational theories. These tree automata are obtained by extending their standard Horn clause representations with equational conditions and monadic rewrite systems. We show in particular that the general membership problem is decidable by proving that the saturation of tree automata pres...
متن کاملDecidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007). TABG can test for equality and disequality modulo a given flat equational theory between brother subterms and between subterms whose positions are defined by the stat...
متن کاملUni cation in Extensions of Shallow Equational Theories
We show that uni cation in certain extensions of shallow equational theories is decidable Our extensions generalize the known classes of shallow or standard equational theories In order to prove de cidability of uni cation in the extensions a class of Horn clause sets called sorted shallow equational theories is introduced This class is a natural extension of tree automata with equality constra...
متن کاملUniication in Extensions of Shallow Equational Theories
We show that uniication in certain extensions of shallow equational theories is decidable. Our extensions generalize the known classes of shallow or standard equational theories. In order to prove de-cidability of uniication in the extensions, a class of Horn clause sets called sorted shallow equational theories is introduced. This class is a natural extension of tree automata with equality con...
متن کاملOn Closure under Complementation of Equational Tree Automata for Theories Extending AC
We study the problem of closure under complementation of languages accepted by one-way and two-way tree automata modulo equational theories. We deal with the equational theories of commutative monoids ( ), idempotent commutative monoids ( ), Abelian groups ( ), and the theories of exclusive-or ( ), generalized exclusive-or ( ), and distributive minus symbol ( ). While the one-way automata for a...
متن کامل